Talking quiescence: a rigorous theory that supports parallel composition, action hiding and determinisation

The notion of quiescence - the absence of outputs - is vital in both behavioural modelling and testing theory. Although the need for quiescence was already recognised in the 90s, it has only been treated as a second-class citizen thus far. This paper moves quiescence into the foreground and introduces the notion of quiescent transition systems (QTSs): an extension of regular input-output transition systems (IOTSs) in which quiescence is represented explicitly, via quiescent transitions. Four carefully crafted rules on the use of quiescent transitions ensure that our QTSs naturally capture quiescent behaviour. We present the building blocks for a comprehensive theory on QTSs supporting parallel composition, action hiding and determinisation. In particular, we prove that these operations preserve all the aforementioned rules. Additionally, we provide a way to transform existing IOTSs into QTSs, allowing even IOTSs as input that already contain some quiescent transitions. As an important application, we show how our QTS framework simplifies the fundamental model-based testing theory formalised around ioco.Comment: In Proceedings MBT 2012, arXiv:1202.582

Weak Sequential Composition in Process Algebras

n this paper we study a special operator for sequential composition, which is defined relative to a dependency relation over the actions of a given system. The idea is that actions which are not dependent (intuitively because they share no common resources) do not have to wait for one another to proceed, even if they are composed sequentially. Such a notion has been studied before in a linear-time setting, but until recently there has been no systematic investigation in the context of process algebras. We give a structural operational semantics for a process algebraic language containing such a sequential composition operator, which shows some interesting interplay with choice. We give a complete axiomatisation of strong bisimilarity and we show consistency of the operational semantics with an event-based denotational semantics developed recently by the second author. The axiom system allows to derive the communication closed layers law, which in the linear time setting has been shown to be a very useful instrument in correctness preserving transformations. We conclude with a couple of examples

cGMP-Dependent Protein Kinase I Is Crucial for Angiogenesis and Postnatal Vasculogenesis

Background Endothelium-derived nitric oxide plays an important role for the bone marrow microenvironment. Since several important effects of nitric oxide are mediated by cGMP-dependent pathways, we investigated the role of the cGMP downstream effector cGMP-dependent protein kinase I (cGKI) on postnatal neovascularization. Methodology/Principal Findings In a disc neovascularization model, cGKI -/- mice showed an impaired neovascularization as compared to their wild-type (WT) littermates. Infusion of WT, but not cGKI -/- bone marrow progenitors rescued the impaired ingrowth of new vessels in cGKI-deficient mice. Bone marrow progenitors from cGKI -/- mice showed reduced proliferation and survival rates. In addition, we used cGKI alpha leucine zipper mutant (LZM) mice as model for cGKI deficiency. LZM mice harbor a mutation in the cGKI alpha leucine zipper that prevents interaction with downstream signaling molecules. Consistently, LZM mice exhibited reduced numbers of vasculogenic progenitors and impaired neovascularization following hindlimb ischemia compared to WT mice. Conclusions/Significance Our findings demonstrate that the cGMP-cGKI pathway is critical for postnatal neovascularization and establish a new role for cGKI in vasculogenesis, which is mediated by bone marrow-derived progenitors

Action Transducers and Timed Automata

The timed automaton model of [LV92, LV93] is a general model for timing-based systems. A notion of timed action transducer is here defined as an automata-theoretic way of representing operations on timed automata. It is shown that two timed trace inclusion relations are substitutive with respect to operations that can be described by timed action transducers. Examples are given of operations that can be described in this way, and a preliminary proposal is given for an appropriate language of operators for describing timing-based systems